The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2).

0 CpxTRS
↳1 DependencyGraphProof (BOTH BOUNDS(ID, ID), 8 ms)
↳2 CpxTRS
↳3 NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 CpxTRS
↳5 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)
↳6 CdtProblem
↳7 CdtLeafRemovalProof (ComplexityIfPolyImplication, 4 ms)
↳8 CdtProblem
↳9 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)
↳10 CdtProblem
↳11 CdtUsableRulesProof (⇔, 0 ms)
↳12 CdtProblem
↳13 CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)), 55 ms)
↳14 CdtProblem
↳15 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)
↳16 BOUNDS(1, 1)

(0) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(n__s(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
half(0) → 0
half(s(0)) → 0
half(s(s(X))) → s(half(X))
half(dbl(X)) → X
terms(X) → n__terms(X)
s(X) → n__s(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
activate(X) → X

Rewrite Strategy: INNERMOST

(1) DependencyGraphProof (BOTH BOUNDS(ID, ID) transformation)

The following rules are not reachable from basic terms in the dependency graph and can be removed:
half(s(0)) → 0
half(s(s(X))) → s(half(X))
half(dbl(X)) → X

(2) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

dbl(0) → 0
half(0) → 0
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
terms(X) → n__terms(X)
terms(N) → cons(recip(sqr(N)), n__terms(n__s(N)))
first(0, X) → nil
dbl(s(X)) → s(s(dbl(X)))
activate(X) → X
sqr(0) → 0
add(0, X) → X
activate(n__s(X)) → s(activate(X))
activate(n__terms(X)) → terms(activate(X))
add(s(X), Y) → s(add(X, Y))
first(X1, X2) → n__first(X1, X2)
sqr(s(X)) → s(add(sqr(X), dbl(X)))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
s(X) → n__s(X)

Rewrite Strategy: INNERMOST

(3) NestedDefinedSymbolProof (BOTH BOUNDS(ID, ID) transformation)

The following defined symbols can occur below the 0th argument of terms: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 0th argument of activate: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 0th argument of first: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 1th argument of first: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 0th argument of sqr: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 0th argument of s: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 0th argument of add: s, sqr, terms, add, dbl, first, activate
The following defined symbols can occur below the 1th argument of add: dbl

Hence, the left-hand sides of the following rules are not basic-reachable and can be removed:
dbl(s(X)) → s(s(dbl(X)))

(4) Obligation:

The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^2).


The TRS R consists of the following rules:

dbl(0) → 0
half(0) → 0
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
terms(X) → n__terms(X)
terms(N) → cons(recip(sqr(N)), n__terms(n__s(N)))
first(0, X) → nil
activate(X) → X
sqr(0) → 0
add(0, X) → X
activate(n__s(X)) → s(activate(X))
activate(n__terms(X)) → terms(activate(X))
add(s(X), Y) → s(add(X, Y))
first(X1, X2) → n__first(X1, X2)
sqr(s(X)) → s(add(sqr(X), dbl(X)))
activate(n__first(X1, X2)) → first(activate(X1), activate(X2))
s(X) → n__s(X)

Rewrite Strategy: INNERMOST

(5) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

dbl(0) → 0
half(0) → 0
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(0, z0) → nil
first(z0, z1) → n__first(z0, z1)
terms(z0) → n__terms(z0)
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0)))
activate(z0) → z0
activate(n__s(z0)) → s(activate(z0))
activate(n__terms(z0)) → terms(activate(z0))
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
sqr(0) → 0
sqr(s(z0)) → s(add(sqr(z0), dbl(z0)))
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
s(z0) → n__s(z0)
Tuples:

DBL(0) → c
HALF(0) → c1
FIRST(s(z0), cons(z1, z2)) → c2(ACTIVATE(z2))
FIRST(0, z0) → c3
FIRST(z0, z1) → c4
TERMS(z0) → c5
TERMS(z0) → c6(SQR(z0))
ACTIVATE(z0) → c7
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(TERMS(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
SQR(0) → c11
SQR(s(z0)) → c12(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0))
ADD(0, z0) → c13
ADD(s(z0), z1) → c14(S(add(z0, z1)), ADD(z0, z1))
S(z0) → c15
S tuples:

DBL(0) → c
HALF(0) → c1
FIRST(s(z0), cons(z1, z2)) → c2(ACTIVATE(z2))
FIRST(0, z0) → c3
FIRST(z0, z1) → c4
TERMS(z0) → c5
TERMS(z0) → c6(SQR(z0))
ACTIVATE(z0) → c7
ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(TERMS(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
SQR(0) → c11
SQR(s(z0)) → c12(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0))
ADD(0, z0) → c13
ADD(s(z0), z1) → c14(S(add(z0, z1)), ADD(z0, z1))
S(z0) → c15
K tuples:none
Defined Rule Symbols:

dbl, half, first, terms, activate, sqr, add, s

Defined Pair Symbols:

DBL, HALF, FIRST, TERMS, ACTIVATE, SQR, ADD, S

Compound Symbols:

c, c1, c2, c3, c4, c5, c6, c7, c8, c9, c10, c11, c12, c13, c14, c15

(7) CdtLeafRemovalProof (ComplexityIfPolyImplication transformation)

Removed 1 leading nodes:

FIRST(s(z0), cons(z1, z2)) → c2(ACTIVATE(z2))
Removed 12 trailing nodes:

SQR(0) → c11
ACTIVATE(z0) → c7
TERMS(z0) → c6(SQR(z0))
S(z0) → c15
ADD(s(z0), z1) → c14(S(add(z0, z1)), ADD(z0, z1))
TERMS(z0) → c5
HALF(0) → c1
FIRST(z0, z1) → c4
SQR(s(z0)) → c12(S(add(sqr(z0), dbl(z0))), ADD(sqr(z0), dbl(z0)), SQR(z0), DBL(z0))
FIRST(0, z0) → c3
DBL(0) → c
ADD(0, z0) → c13

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

dbl(0) → 0
half(0) → 0
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(0, z0) → nil
first(z0, z1) → n__first(z0, z1)
terms(z0) → n__terms(z0)
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0)))
activate(z0) → z0
activate(n__s(z0)) → s(activate(z0))
activate(n__terms(z0)) → terms(activate(z0))
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
sqr(0) → 0
sqr(s(z0)) → s(add(sqr(z0), dbl(z0)))
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
s(z0) → n__s(z0)
Tuples:

ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(TERMS(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__s(z0)) → c8(S(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(TERMS(activate(z0)), ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(FIRST(activate(z0), activate(z1)), ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

dbl, half, first, terms, activate, sqr, add, s

Defined Pair Symbols:

ACTIVATE

Compound Symbols:

c8, c9, c10

(9) CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID) transformation)

Removed 3 trailing tuple parts

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

dbl(0) → 0
half(0) → 0
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(0, z0) → nil
first(z0, z1) → n__first(z0, z1)
terms(z0) → n__terms(z0)
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0)))
activate(z0) → z0
activate(n__s(z0)) → s(activate(z0))
activate(n__terms(z0)) → terms(activate(z0))
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
sqr(0) → 0
sqr(s(z0)) → s(add(sqr(z0), dbl(z0)))
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
s(z0) → n__s(z0)
Tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:

dbl, half, first, terms, activate, sqr, add, s

Defined Pair Symbols:

ACTIVATE

Compound Symbols:

c8, c9, c10

(11) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

dbl(0) → 0
half(0) → 0
first(s(z0), cons(z1, z2)) → cons(z1, n__first(z0, activate(z2)))
first(0, z0) → nil
first(z0, z1) → n__first(z0, z1)
terms(z0) → n__terms(z0)
terms(z0) → cons(recip(sqr(z0)), n__terms(n__s(z0)))
activate(z0) → z0
activate(n__s(z0)) → s(activate(z0))
activate(n__terms(z0)) → terms(activate(z0))
activate(n__first(z0, z1)) → first(activate(z0), activate(z1))
sqr(0) → 0
sqr(s(z0)) → s(add(sqr(z0), dbl(z0)))
add(0, z0) → z0
add(s(z0), z1) → s(add(z0, z1))
s(z0) → n__s(z0)

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
S tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:

ACTIVATE

Compound Symbols:

c8, c9, c10

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^2)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
We considered the (Usable) Rules:none
And the Tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(ACTIVATE(x1)) = [1] + x1 + x12   
POL(c10(x1, x2)) = x1 + x2   
POL(c8(x1)) = x1   
POL(c9(x1)) = x1   
POL(n__first(x1, x2)) = [1] + x1 + x2   
POL(n__s(x1)) = [1] + x1   
POL(n__terms(x1)) = [1] + x1   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
S tuples:none
K tuples:

ACTIVATE(n__s(z0)) → c8(ACTIVATE(z0))
ACTIVATE(n__terms(z0)) → c9(ACTIVATE(z0))
ACTIVATE(n__first(z0, z1)) → c10(ACTIVATE(z0), ACTIVATE(z1))
Defined Rule Symbols:none

Defined Pair Symbols:

ACTIVATE

Compound Symbols:

c8, c9, c10

(15) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(16) BOUNDS(1, 1)